Formal Specification and Implementation of Priority Queue with Starvation Handling
نویسندگان
چکیده
Formal specification of software components, as a core research area in software engineering, has been widely studied in decades. Although quite a few formal models have been proposed for this purpose, specification of concrete software components is still a challenging task due to the complexity of the functionalities of the components. In this paper, we use the stream function model to specify the behavior of priority queue, a commonly used software component. This specification formally defines the regular behavior and fault tolerance behavior of priority queue. In particular, a priority-concatenation operator is defined to handle the ordering of data items to ensure the highest-priority item is removed first. A finite state machine as an implementation is built based on this specification. In addition, we also discuss a priority upgrading approach to handle possible starvation situation of low-priority data items in the priority queue.
منابع مشابه
Mitigating Starvation of Multi-Level Feedback Queue Scheduling with Declining Max Weighted Average
This paper presents a technique that mitigates starvation in the MLFQ that has low computation overhead and does not jeopardize the servicing of interactive and high-priority processes. The algorithm adds a second level of feedback using an extension of exponential averaging called Declining Max Weighted Average (DMWA) to redirect CPU time to the lowest priority queue. Feedback involving the ex...
متن کاملOn Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)
We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملStarvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE)
Need for high speed internet connectivity has lead to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due of its flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we proposed a Delay ba...
متن کاملCAMAC: a context-aware mandatory access control model
Mandatory access control models have traditionally been employed as a robust security mechanism in multilevel security environments such as military domains. In traditional mandatory models, the security classes associated with entities are context-insensitive. However, context-sensitivity of security classes and flexibility of access control mechanisms may be required especially in pervasive c...
متن کامل